825C - Multi-judge Solving - CodeForces Solution

#include <bits/stdc++.h>
using namespace std;
#define ll long long
//for math u can observe something related to gcd or something related to even or odd to draw some conclusions
//if your answer is lieing in a range then binary search is the best approach to solve that problem
//for errors check out of bound and overflow of integers
//sorting,binary search,dynamic programming,greedy are some of the most used techniques to solve the problems
//until some element it is good and then next it is bad u should use binary search
//to find the first good element or to find the first bad element we use binary search\
//if there are digits then remember that the digits are just from 0-9 so u can use two loops the same for character a-z they are just 26
int main() {
	// your code goes here
	int t;
	t=1;
	while(t--)
	{
	  int n;
	  ll k;
	  cin>>n>>k;
	  ll a[n];
	  for(int i=0;i<n;i++)
	  {
	      cin>>a[i];
	  }

	  int cnt=0;
	  ll maxi=k;
	  sort(a,a+n);
     int p=0;
	  for(int i=0;i<n;i++)
	  {
	      if(i!=0)
	      {
	          maxi=max(maxi,a[i-1]);
	          if(a[i]>2*maxi)
              {

                while(a[i]>2*maxi )
                {
                    maxi*=2;
                    cnt++;
                }


              }
	      }
	      else
	      {
	          if(a[i]>2*k)
              {
                  maxi=k;
                  while(a[i]>2*maxi)
                {
                    maxi*=2;
                    cnt++;
                }


              }
	      }
	  }
	  cout<<cnt<<endl;
	}


	return 0;
}